Are There Practical Alternatives to Alpha-beta in Computer Chess?
نویسنده
چکیده
The success of the alpha-beta algorithm in game-playing has shown its value for problem solving in artiicial intelligence, especially in the domain of two-person zero-sum games with perfect-information. However, there exist diierent algorithms for game-tree search. This paper describes and assesses those proposed alternatives according to how they try to overcome the limitations of alpha-beta. We conclude that for computer chess no practical alternative exists, but many promising ideas have good potential to change that in the future.
منابع مشابه
Theory and practical strategies for e cient alpha-beta-searches in computer chess
The aim of this work is to give an overview of the theory of e cient alpha-beta-searches in computer chess and to explain the practical strategies implemented in the FUSc# chess program ([6]). The main focus is put on two topics: the rst one is e cient move generation with a technique called rotated bitboards ([10]), and the second one is how to carry out e cient alpha-beta-searches by optimizi...
متن کاملImplementation of a Distributed Chess Playing Software System Using Principal Variation Splitting
Many chess playing artificial intelligence software take considerable time in calculating the optimal move that can be made by a computer system. Most computer systems that make such calculations use some version of the minimax search with alpha beta pruning. Minimax with alpha beta pruning can be made distributed with principal variation splitting. The system can thus be used to reduce the tim...
متن کاملA Distributed Chess Playing Software System Model Using Dynamic CPU Availability Prediction
Traditionally chess gaming software takes considerable amount of time in calculating the optimal move that can be made by a computer system. Most computer systems that make such calculations use some version of the minimax search with alpha beta pruning. Minimax with alpha beta pruning can be made distributed with principal variation splitting. The system can thus be used to reduce the time nec...
متن کاملشناسایی و چالشهای تعقیب کیفری با نگاهی به حقوق انگلستان
Abstract Alternatives to prosecution are the third way and middle method between the prosecution and unconditional archiving the case. Objects of punishment, in this method, Will be achieved without prosecution and punishment. Alternatives to prosecution are based on the cognitive school, criminology and practical considerations and In Islamic teachings, there are many cases applying this me...
متن کاملLarge-Scale Optimization for Evaluation Functions with Minimax Search
This paper presents a new method, Minimax Tree Optimization (MMTO), to learn a heuristic evaluation function of a practical alpha-beta search program. The evaluation function may be a linear or non-linear combination of weighted features, and the weights are the parameters to be optimized. To control the search results so that the move decisions agree with the game records of human experts, a w...
متن کامل